A mathematician reflecting on the International Olympiad in Informatics
نویسنده
چکیده
In July 2013, students from 80–90 countries will descend upon Australia to take part in the International Olympiad in Informatics (IOI). On the surface the IOI is a computer programming competition, but in fact it involves a great deal of both mathematical technique and mathematical creativity. In this short article we introduce the readers to the IOI and the mathematics within. 1 Introducing the IOI The International Olympiad in Informatics (IOI) is one of the five broad-brush Science Olympiads for high school students, which also cover Biology, Chemistry, Physics, and of course Mathematics. Founded in 1989 under the auspices of UNESCO, the IOI is one of the youngest Science Olympiads, but it has grown quickly to now include over 80 countries, making it the second-largest (behind only Mathematics). Despite “informatics” being roughly synonymous with computer science, the IOI has always had strong associations with mathematicians. Locally, the Australian team is trained by the Australian Mathematics Trust, and all of Australia’s team leaders over the past decade have been trained mathematicians.1 Internationally, the first IOI was organised by Petar Kenderov, a highly-respected Bulgarian mathematician, and it is common to find fellow mathematicians amongst the myriad of team leaders and deputies. It was recently announced that Australia will host IOI 2013, with the event to be held at The University of Queensland in partnership with the Australian Mathematics Trust. This is a great honour for both the mathematics and computer science communities in Australia, and readers will doubtless hear more about the event as it draws nearer. In the meantime, this short article aims to (i) introduce the IOI to readers with whom it is unfamiliar, and (ii) illustrate the mathematics that runs throughout the competition. ∗School of Mathematics and Physics, The University of Queensland, Brisbane QLD 4072, Australia. E-mail: [email protected] Robbie Gates (1999–2000) holds a PhD in category theory, the author (2001–2008) holds a PhD in geometry and topology, and Bernard Blackham (2009–) holds a BCM with a major in pure mathematics.
منابع مشابه
The Role of Competitions in Education
I give an historic overview of education, competition, and competition within education, with an emphasis on computing science education. It appears that large-scale formalized competitions are a relatively recent phenomenon in the long history of education. I argue that in the future the role of competitions should be expanded, but that this requires more effort from all branches of society. A...
متن کاملRandom Factors in IOI 2005 Test Case Scoring
We examine the precision with which the cumulative score from a suite of test cases ranks participants in the International Olympiad in Informatics (IOI). Our concern is the ability of these scores to reflect achievement at all levels, as opposed to reflecting chance or arbitrary factors involved in composing the test suite. Test cases are assumed to be drawn from an infinite population of simi...
متن کاملThe IOI is (not) a Science Olympiad
The International Olympiad in Informatics (IOI) aspires to be science olympiad alongside the international olympiads in mathematics, physics, chemistry, and biology. We argue that, in its current format, the IOI fails to be scientific in an important way. Informatics as a discipline is well suited to a scientific approach and it offers numerous possibilities for competitions with a high scienti...
متن کاملInformatics olympiads: Approaching mathematics through code
Many readers are familiar with the International Mathematical Olympiad (IMO), a pinnacle in the yearly calendar of mathematics competitions. Here we introduce its cousin in computer science, the International Olympiad in Informatics (IOI). The International Olympiad in Informatics is one of the newer Science Olympiads, beginning in 1989 in Bulgaria under the leadership of Petar Kenderov. In its...
متن کاملVariations for spanning trees
Coursebooks discussing graph algorithms usually have a chapter on minimum spanning trees. It usually contains Prim’s and Kruskal’s algorithms [1, 2] but often lacks other applications. This type of problem is rarely present at informatics competitions or in tests in secondary or higher level informatics education This article is aimed at describing some competition tasks that help us prove that...
متن کامل